Towards Diagrammatic Specifications of Symbolic Computation Systems
نویسندگان
چکیده
The aim of this work is to present an ongoing project to formalize, in the framework of diagrammatic logic (due to Dominique Duval and Christian Lair) some data structures appearing in Sergeraert’s symbolic computation systems Kenzo and EAT. More precisely, we intend to translate into the diagrammatic setting a previous work based on standard algebraic specification techniques. In particular, we give hints on the reason why an important construction (called imp construction) in the specification of the systems can be understood as a freely generating functor between suitable categories of diagrammatic realizations. Even if very partial, these positive results seem to indicate that this new kind of specification is promising in the field of symbolic computation.
منابع مشابه
On the Readability of Diagrammatic Proofs
Recently, much effort has been placed on developing diagrammatic logics, with a focus on obtaining sound and complete reasoning systems. A hypothesis of the diagrammatic reasoning community is that many people find diagrammatic proofs easier to read than symbolic proofs. This hypothesis has not been thoroughly tested, although significant effort has been directed towards understanding what make...
متن کاملQualitative Structural Analysis Using Diagrammatic Reasoning
Diagrammatic reasoning is a type of reasoning in which the pr imary means of inference is direct manipulat ion and inspection of a diagram. Diagrammatic reasoning is prevalent in human problem solving behavior, especially for problems involving spatial relations among physical objects. Our research examines the relationship between diagrammatic and symbolic reasoning in a computational framewor...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملRobust Nonlinear Feedback Design via Quantifier Elimination Theory
In this paper symbolic-computation methods are used to design simple, fixed-structure, robust controllers for nonlinear systems. Design specifications are reduced to logically quantified polynomial inequalities. The quantifier-elimination (QE) software package QEPCAD is used to eliminate quantifiers on state and plant parameters, to obtain regions of admissible controller parameters, and to gua...
متن کاملAction Language verifier: an infinite-state model checker for reactive software specifications
Action Language is a specification language for reactive software systems. In this paper, we present the syntax and the semantics of the Action Language and we also present an infinite-state symbolic model checker called Action Language Verifier (ALV) that verifies (or falsifies) CTL properties of Action Language specifications. ALV is built on top of the Composite Symbolic Library, which is a ...
متن کامل